An annotated bibliography of GRASP - Part I: Algorithms

نویسندگان

  • Paola Festa
  • Mauricio G. C. Resende
چکیده

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous papers on the basic aspects of GRASP, as well as enhancements to the basic metaheuristic have appeared in the literature. GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing. This is the first of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. This paper covers algorithmic aspects of GRASP.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grasp: an Annotated Bibliography

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous p...

متن کامل

An annotated bibliography of GRASP-Part II: Applications

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Since 1989, numerous p...

متن کامل

An Annotated Bibliography on Scheduling Algorithms for Fixed and Dynamic Priority Real-Time Systems, with Hard, Firm or Soft Deadline Tasks, and Emphasis on Feasibility Testing [Draft]

In this report we present an annotated bibliography on research work relating to real-time scheduling of tasks. Special emphasis is placed on the different off-line and on-line schedulability testing algorithms for hard, firm and soft real-time tasks. Each proposed algorithm is presented and analyzed in terms of asymptotic time and space complexity. Algorithms are critically examined, when ther...

متن کامل

پیشنهاد چارچوبی نو برای کتابشناسی توصیفی- تحلیلی با تأکید بر دیدگاه انتقادی

Purpose: composing and formulating bibliography is key activity in scientific area. It is necessary to conduct this activity on the basis of an organized and coherent framework in order to prevent wasting time and cost, unwillingness of audiences, incoherency of book description/analysis structure, and imperfect evaluation. Since the lack of such tool to formulation of bibliographies is evident...

متن کامل

An annotated bibliography of network interior point methods

This paper presents an annotated bibliography on interior point methods for solving network flow problems. We consider single and multicommodity network flow problems, as well as preconditioners used in implementations of conjugate gradient methods for solving the normal systems of equations that arise in interior network flow algorithms. Applications in electrical engineering and miscellaneous...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ITOR

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2009